parallel adj. 1.平行的;并行的 (to; with); 【電學(xué)】并聯(lián)的。 2.同一方向的,同一目的的。 3.相同的,同樣的,相似的,對(duì)應(yīng)的。 a parallel instance [case] 同樣的例子[情況]。 His prudence is parallel to his zeal. 他固然謹(jǐn)慎,也同樣熱心。 run parallel with 和…平行。 n. 1.平行線[面]。 2.相似,類似;相似物,相當(dāng)?shù)娜薣物]。 3.比較,對(duì)比。 4.緯度圈,緯線。 5.【軍事】平行塹壕。 6.【印刷】平行號(hào) 〔‖〕。 7.【電學(xué)】并聯(lián)。 the parallel of altitude [declination, latitude] 平緯[赤緯,黃緯]圈。 draw a parallel between ... 在…之間作對(duì)比。 in parallel with 和…并行,和…對(duì)應(yīng)。 without (a) parallel 無與匹敵的。 vt. (-l(l)-) 1.使成平行;與…平行。 2.與…相匹[配得上,相應(yīng)]。 3.對(duì)比,比較… (with)。 n. -ism 【計(jì)算機(jī)】并行計(jì)算。
The max degree option on dsntip4 determines the maximum degree of parallelism maximum number of parallel tasks Dsntip4上的max degree選項(xiàng)決定了最大并行度(并行任務(wù)的最大數(shù)量) 。
I recommend that you evaluate the virtual storage capacity and constraints in your z os environment , and adjust this parameter as needed , so that db2 will not create more parallel tasks than your virtual storage can handle 我建議您先估計(jì)z / os環(huán)境中的虛擬存儲(chǔ)能力和局限性,這樣db2就不至于創(chuàng)建多于虛擬存儲(chǔ)所能處理的并行任務(wù)。
For example , an application consisting of many independent parallel tasks executes much faster when the tasks are spread across a large number of compute resources than by using a single server or cluster 例如,與使用單個(gè)服務(wù)器或群集執(zhí)行的執(zhí)行速度相比,包含多個(gè)獨(dú)立并行任務(wù)的應(yīng)用程序在將任務(wù)劃分到大量計(jì)算資源上,其執(zhí)行速度要更快一些。
Some improvements are made to enhance the generic algorithm ' s stability self adaptability and optimization efficiency . based on the ttg model , the co - synthesis method can map parallel task graphs to multiple processing unlts 本文提出了基于改進(jìn)遺傳算法解決軟硬件協(xié)同綜合問題的新方法,基于ttg模型,該方法能夠?qū)崿F(xiàn)多并發(fā)任務(wù)流在多處理單元結(jié)構(gòu)上的映射。
As for the sequential and parallel processing , which exists in the field of cscw , temporal constrains are used to describe the temporal relations between the sequential and parallel tasks . an application , which contains sequential and parallel sub - tasks , is shown as an example at last 同時(shí),文中分析了協(xié)同工作中存在的串行和并行工作,采用時(shí)態(tài)約束描述了串、并行任務(wù)間的時(shí)序關(guān)系,并描述了一個(gè)并行協(xié)同工作的實(shí)例。
Although this and my previous twelve scheduling tips are not an exhaustive list of ways to improve scheduling , i m confident that acknowledging and plotting your parallel tasks in this way will provide some ease to organizations that are taking on increasing workload 盡管這個(gè)和我以前的12點(diǎn)時(shí)間安排的提示都不是對(duì)改進(jìn)時(shí)間安排的詳盡的方法列表,我相信用這種方法來承認(rèn)和測繪并發(fā)的任務(wù)可以為那些負(fù)擔(dān)增加工作負(fù)荷的組織提供一些方便。
Firstly , we need consider more in cooperation and message - pass between parallel tasks . secondly , the parallel design pattern is different from that of sing - alone program . thirdly , parallel program has to call complicated apis to accomplish data transfer 首先,并行程序的分析與設(shè)計(jì)需要更多的考慮各并行任務(wù)的協(xié)同和消息通信機(jī)制;其次,并行程序的編寫模式與單機(jī)程序不同;最后,并行程序需要調(diào)用并行平臺(tái)的復(fù)雜的通信原語來完成數(shù)據(jù)的傳送。
In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems , one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio , another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan , we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1 . 6 第一個(gè)算法利用裝箱問題中的ff ( firstfit )算法求解極大化按期完工工件數(shù)的平行機(jī)排序問題pm d _ j = d n - u _ j ,該近似算法具有漸近性能比下界。第二個(gè)近似算法利用二維裝箱中strippacking問題的算法求解以極小化makespan為目標(biāo)的帶并行工件的平行機(jī)排序問題,該算法的漸近性能比具有下界1 . 5和上界1 . 6 。
It preestablish a parallel design pattern for each parallel project based on master / slave architecture , and the communication between computers is transparent to programmers . in another words , when programmers are developing parallel programs , they do n ' t need to learn any complicated primitives and write any codes related with communication between parallel tasks . just only set some parameters in the visual interfaces that provided by platform , and the codes will be generated by our system automatically and inserted to the fittest place in the files 系統(tǒng)為每一個(gè)并行計(jì)算工程設(shè)定了一個(gè)基于master slave架構(gòu)的并行編程模型,并且使得各結(jié)點(diǎn)機(jī)之間的通信對(duì)于開發(fā)人員透明化,也就是說,開發(fā)人員在開發(fā)并行程序時(shí),無需了解紛繁復(fù)雜的通信原語,不涉及任務(wù)之間通信的代碼,只需要在并行程序開發(fā)平臺(tái)提供的可視化界面上對(duì)數(shù)據(jù)的傳送進(jìn)行設(shè)定,通信代碼將自動(dòng)生成并插入到程序合適的地方。